Kripke Logical Relations and PCF
نویسندگان
چکیده
Sieber has described a model of PCF consisting of continuous functions that are invariant under certain ((nitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of \Kripke logical relations" introduced by Jung and Tiuryn to characterize-deenability.
منابع مشابه
Pcf Deenability via Kripke Logical Relations (after O'hearn and Riecke)
The material presented here is an exposition of an application of logical relations to the problem of full abstraction for PCF. The point is to see Kripke logical relations as introduced by Jung and Tiuryn in [5] and used by O'Hearn and Riecke in [6] to give a logical characterization of sequentiality, within the mainstream of the classical notion of logical relations. The main di erence with r...
متن کاملLogical Relations for PCF
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the literature. We show that the Y combinator coincides with the domaintheoretic fixpoint operator, that parallel-or and the Plotkin existential are not definable in PCF, that the continuation semantics for PCF coincides with the direct semantics, and that our domain-theoretic semantics for PCF is a...
متن کاملLogical aspects of logical frameworks
This thesis provides a model–theoretic semantic analysis of aspects of the LF logical framework. The LF logical framework is the λΠ-calculus together with the judgements-as-types representation mechanism. A denotational semantics is provided for the λΠ-calculus in terms of Kripke λΠ-models. These are a generalization of the Kripke lambda models of Mitchell and Moggi to dependent types and are b...
متن کاملKripke Open Bisimulation - A Marriage of Game Semantics and Operational Techniques
Proving that two programs are contextually equivalent is notoriously hard, particularly for functional languages with references (i.e., local states). Many operational techniques have been designed to prove such equivalences, and fully abstract denotational model, using game semantics, have been built for such languages. In this work, we marry ideas coming from trace semantics, an operational v...
متن کاملThe Marriage of Bisimulations and Kripke Logical Relations Technical Appendix
1 Language 3 1.1 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Dynamic Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Static Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Contextual Equivalence . . . . . . . . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 120 شماره
صفحات -
تاریخ انتشار 1995